Interconvertibility of Set Constraints and Context-free Language Reachability
نویسندگان
چکیده
We show the interconvertibility of context-free-language reachability problems and a class of set-constraint problems: given a context-free-language reachability problem, we show how to construct a set-constraint problem whose answer gives a solution to the reachability problem; given a set-constraint problem, we show how to construct a context-free-language reachability problem whose answer gives a solution to the set-constraint problem. The interconvertibility of these two formalisms ooers an conceptual advantage akin to the advantage gained from the interconvertibility of nite-state automata and regular expressions in formal language theory, namely, a problem can be formulated in whichever formalism is most natural. It also ooers some insight into the \O(n 3) bottleneck" for diierent types of program-analysis problems, and allows results previously obtained for context-free-language reachability problems to be applied to set-constraint problems.
منابع مشابه
Interconvertibility of a Class of Set Constraints and Context-free-language Reachability 1
We show the interconvertibility of context-free-language reachability problems and a class of set-constraint problems: given a context-free-language reachability problem, we show how to construct a set-constraint problem whose answer gives a solution to the reachability problem; given a set-constraint problem, we show how to construct a context-free-language reachability problem whose answer gi...
متن کاملInterconvertibility of a class of set constraints and context-free-language reachability
We show the interconvertibility of context-free-language reachability problems and a class of set-constraint problems: given a context-free-language reachability problem, we show how to construct a set-constraint problem whose answer gives a solution to the reachability problem; given a set-constraint problem, we show how to construct a context-free-language reachability problem whose answer gi...
متن کاملInterconvertibility of Set Constraints and Context-free Language Reachability 1
We show the interconvertibility of context-free-language reachability problems and a class of set-constraint problems: given a context-free-language reachability problem, we show how to construct a set-constraint problem whose answer gives a solution to the reachability problem; given a set-constraint problem, we show how to construct a context-free-language reachability problem whose answer gi...
متن کاملFrom Polymorphic Subtyping to CFL Reachability: Context-Sensitive Flow Analysis Using Instantiation Constraints
متن کامل
Push-Down Automata with Gap-Order Constraints
We consider push-down automata with data (PDAD) that operate on variables ranging over the set of natural numbers. The conditions on variables are defined via gap-order constraint. Gap-order constraints allow to compare variables for equality, or to check that the gap between the values of two variables exceeds a given natural number. The messages inside the stack are equipped with values that ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998